Optimal Approximation Algorithms for Reoptimization of Constraint Satisfaction Problems
نویسندگان
چکیده
منابع مشابه
Approximation for Maximum Surjective Constraint Satisfaction Problems
Maximum surjective constraint satisfaction problems (Max-SurCSPs) are computational problems where we are given a set of variables denoting values from a finite domain B and a set of constraints on the variables. A solution to such a problem is a surjective mapping from the set of variables to B such that the number of satisfied constraints is maximized. We study the approximation performance t...
متن کاملExact algorithms for constraint satisfaction problems
The Boolean satisfiability problem (SAT) and its generalization to variables of higher arities – constraint satisfaction problems (CSP) – can arguably be called the most “natural” of all NP-complete problems. The present work is concerned with their algorithmic treatment. It consists of two parts. The first part investigates CSPs for which satisfiability follows from the famous Lovász Local Lem...
متن کاملOptimal Refutations for Constraint Satisfaction Problems
Variable ordering heuristics have long been an important component of constraint satisfaction search algorithms. In this paper we study the behaviour of standard variable ordering heuristics when searching an insoluble (sub)problem. We employ the notion of an optimal refutation of an insoluble (sub)problem and describe an algorithm for obtaining it. We propose a novel approach to empirically lo...
متن کاملBelief propagation algorithms for constraint satisfaction problems
Belief propagation algorithms for constraint satisfaction problems by Elitza Nikolaeva Maneva Doctor of Philosophy in Computer Science and the Designated Emphasis in Communication, Computation, and Statistics University of California, Berkeley Professor Alistair Sinclair, Chair We consider applications of belief propagation algorithms to Boolean constraint satisfaction problems (CSPs), such as ...
متن کاملBacktracking algorithms for constraint satisfaction problems
Over the past twenty ve years many backtracking algorithms have been developed for constraint satisfaction problems This survey describes the basic backtrack search within the search space framework and then presents a number of improvements developed in the past two decades including look back methods such as backjumping constraint recording backmarking and look ahead methods such as forward c...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: American Journal of Operations Research
سال: 2013
ISSN: 2160-8830,2160-8849
DOI: 10.4236/ajor.2013.32025